End - to - End Delay Bounds and Bu er Sizing in ATMNetworksA
نویسنده
چکیده
Using a general \minimum-bandwidth" property of ATM bandwidth schedulers, we obtain end-to-end delay bounds over arbitrary virtual circuits of such schedulers. For (;)-constrained sources, we specify buuer sizing requirements at each hop for lossless transmission. The buuer sizing results are sharpened for the case of the idling Virtual Clock (IVC) scheduler proposed in 3].
منابع مشابه
A Polynomial Time Optimal Algorithm for Simultaneous Bu er and Wire Sizing
An interconnect joining a source and a sink is divided into xed length uniform width wire segments and some adjacent segments have bu ers in between The problem we considered is to simultaneously size the bu ers and the segments so that the Elmore delay from the source to the sink is minimized Previously no polynomial time al gorithm for the problem has been reported in literature In this paper...
متن کاملInterleaving Bu er Insertion and Transistor Sizing into a Single Optimization
Bu er insertion is a technique that is used either to increase the driving power of a path in a circuit, or to isolate large capacitive loads that lie on noncritical or less critical paths. Gate sizing sets the sizes of gates within a circuit to achieve a given timing speci cation. Traditional design techniques perform gate sizing and bu er insertion as two separate and independent steps during...
متن کاملA Novel Buffer Management Architecture for Epidemic Routing in Delay Tolerant Networks (DTNs)
Delay tolerant networks (DTNs) are wireless networks in which an end-to-end path for a given node pair can never exist for an extended period. It has been reported as a viable approach in launching multiple message replicas in order to increase message delivery ratio and reduce message delivery delay. This advantage, nonetheless, is at the expense of taking more bu er space at each node. The co...
متن کاملComment on \ A Deterministic Approach to the End - to - end Analysis of Packet Flows in Connection Oriented Networks
We prove that the bu er bound in [CFZF98] can be improved, by using a modi cation of the proofs in the original paper [CFZF98], together with so-called network calculus bounds. We also show that the delay bound in [CFZF98] is the sum of worst case queuing delays at all nodes along the path of a connection.
متن کاملBu ered Steiner Tree Construction with Wire Sizing for Interconnect Layout Optimization
This paper presents an e cient algorithm for bu ered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm nds a Steiner tree with bu er insertion and wire sizing so that the required arrival time (or timing slack) at the source is maximized. The unique contribution of our...
متن کامل